Overelaxed hit-and-run Monte Carlo for the uniform sampling of convex bodies with applications in metabolic network analysis
نویسندگان
چکیده
The uniform sampling of convex regions in high dimension is an important computational issue, from both theoretical and applied point of view. The hit-and-run montecarlo algorithms are the most efficient methods known to perform it and one of their bottlenecks relies in the difficulty of escaping from tight corners in high dimension. Inspired by optimized montecarlo methods used in statistical mechanics we define a new algorithm by overelaxing the hit-and-run dynamics. We made numerical simulations on high dimensional simplices in order to test its performances, pointing out its improved ability to escape from angles and finally apply it to an inference problem in the steady state dynamics of metabolic networks.
منابع مشابه
Monte Carlo uniform sampling of high-dimensional convex polytopes: reducing the condition number with applications in metabolic network analysis
The uniform sampling of convex polytopes is an interesting computational problem with many applications in inference from linear constraints, but the performances of sampling algorithms can be affected by ill-conditioning. This is the case of inferring the feasible steady states in models of metabolic networks, since they can show heterogeneous timescales. In this work we focus on rounding proc...
متن کاملUniform Sampling of Steady States in Metabolic Networks: Heterogeneous Scales and Rounding
The uniform sampling of convex polytopes is an interesting computational problem with many applications in inference from linear constraints, but the performances of sampling algorithms can be affected by ill-conditioning. This is the case of inferring the feasible steady states in models of metabolic networks, since they can show heterogeneous time scales. In this work we focus on rounding pro...
متن کاملCHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models
Summary In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inheren...
متن کاملZonotope Hit-and-run for Efficient Sampling from Projection DPPs
Determinantal point processes (DPPs) are distributions over sets of items that model diversity using kernels. Their applications in machine learning include summary extraction and recommendation systems. Yet, the cost of sampling from a DPP is prohibitive in large-scale applications, which has triggered an effort towards efficient approximate samplers. We build a novel MCMC sampler that combine...
متن کاملHit-and-run for numerical integration
We study the numerical computation of an expectation of a bounded function f with respect to a measure given by a non-normalized density on a convex body K ⊂ Rd . We assume that the density is log-concave, satisfies a variability condition and is not too narrow. In [19, 25, 26] it is required that K is the Euclidean unit ball. We consider general convex bodies or even the whole Rd and show that...
متن کامل